https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:44857 Mon 24 Oct 2022 11:02:39 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:32967 Mon 23 Sep 2019 12:04:45 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:32495 G be a graph with vertex set ^V(G) and edge set ^E(G). We consider the problem of orienting the edges of a complete bipartite graph ^K_n,n so only two different in-degrees ^a and ^b occur. An obvious necessary condition for orienting the edges of ^G so that only two in-degrees ^a and ^b occur, is that there exist positive integers ^s and ^t satisfying ^s+t=|V(G)| and ^as+bt=|V(G)|. In this paper, we show that the necessary condition is also sufficient for a complete bipartite graph ^K_n,n. Furthermore, we give the algorithms of orientations with only two in-degrees of ^K_n,n.]]> Mon 23 Sep 2019 11:31:42 AEST ]]>